A more efficient way of finding Hamiltonian cycle
نویسنده
چکیده
Algorithm tests if a Hamiltonian cycle exists in directed graphs, if it is exists algorithm can show found Hamiltonian cycle. If you want to test an undirected graph, such a graph should be converted to the form of directed graph. Previously known algorithm solving Hamiltonian cycle problem brute-force search can’t handle relatively small graphs. Algorithm presented here is referred to simply as ”algorithm” in this paper.
منابع مشابه
Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملA linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
The Hamiltonian cycle problem is one of the most popular NP-complete problems, and remains NP-complete even if we restrict ourselves to a class of (3-connected cubic) planar graphs [5,9]. Therefore, there seems to be no polynomial-time algorithm for the Hamiltonian cycle problem. However, for certain (nontrivial) classes of restricted graphs, there exist polynomial-time algorithms [3,4,6]. In f...
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملSack Layout
Recently there has been interest in DWDM-based optical networks that are assumed to employ exactly two working fibers uniformly on every span (or “link”). At the fiber level such networks are referred to as homogeneous networks. An interesting and highly efficient strategy for protection of such networks is to use a single dark-fiber pcycle formed on a Hamiltonian cycle (if it exists). We show ...
متن کاملOn the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle is NP -hard in general, and no polynomial time algorithm is known for the problem of finding a second Hamiltonian cycle when one such cycle is given as part of the input. We investigate the complexity of approximating this problem where by a feasible solution we mean a(nother) cycle in t...
متن کامل